Learning Stochastic Finite Automata for Musical Style Recognition
نویسندگان
چکیده
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We use them to model musical styles: a same automaton can be used to classify new melodies but also to generate them. Through grammatical inference these automata are learned and new pieces of music can be parsed. We show that this works by proposing promising classification results and discuss further work.
منابع مشابه
Learning Regular Grammars to Model Musical Style: Comparing Different Coding Schemes
An application of Grammatical Inference (GI) in the field of Music Processing is presented, were Regular Grammars are used for modeling musical style. The interest in modeling musical style resides in the use of these models in applications, such as Automatic Composition and Automatic Musical Style Recognition. We have studied three GI Algorithms, which have been previously applied successfully...
متن کاملLearning k-edge Deterministic Finite Automata in the Framework of Active Learning
One of most attractive topics in grammatical inference is theoretically study on learnability of some classes of automata corresponding with defined formal languages. For last two decades a number of theoretical results have been reported and played as essential knowledge for applications in other fileds such as speech recognition and music-style recognition. In this paper, we consider the prob...
متن کاملLinks between multiplicity automata, observable operator models and predictive state representations: a unified learning framework
Stochastic multiplicity automata (SMA) are weighted finite automata that generalize probabilistic automata. They have been used in the context of probabilistic grammatical inference. Observable operator models (OOMs) are a generalization of hidden Markov models, which in turn are models for discrete-valued stochastic processes and are used ubiquitously in the context of speech recognition and b...
متن کاملLearning Probabilistic Residual Finite State Automata
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. We show that this class can be characterized by a simple intrinsic property of the stochastic languages they generate (the set of residual languages is finitely generated) and that it admits canonical minimal forms. We prove that there are more languages generated by PRFA than by Probabilistic Dete...
متن کاملPAC learning of Probabilistic Automaton based on the Method of Moments
Probabilitic Finite Automata (PFA) are generative graphical models that define distributions with latent variables over finite sequences of symbols, a.k.a. stochastic languages. Traditionally, unsupervised learning of PFA is performed through algorithms that iteratively improves the likelihood like the Expectation-Maximization (EM) algorithm. Recently, learning algorithms based on the so-called...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005